Discrepancy-Bounded Depth First Search
نویسندگان
چکیده
In this paper, we present a novel discrepancy-based search technique implemented as an instance of the generic search procedures framework introduced in [10]. Our empirical results indicate that the Discrepancy-Bounded Depth First Search (DBDFS) procedure exhibits a number of good properties. As a discrepancy based search technique, it is able to quickly find solution with low deviation from the optimal solution. In addition, it revisits fewer nodes than other discrepancy-based techniques (e.g., Limited Discrepancy Search), making it a good candidate for proving optimal solutions.
منابع مشابه
Depth - bounded Discrepancy
Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...
متن کاملDepth-bounded Discrepancy Search
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...
متن کاملClimbing Depth-Bounded Discrepancy Search for Solving Hybrid Flow Shop Problems
This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present here an adaptation of the Depth-bounded Discrepancy Search (DDS) method to obtain near-optimal solutions with makespan...
متن کاملParallel Depth-Bounded Discrepancy Search
Search strategies such as Limited Discrepancy Search (LDS) and Depth-bounded Discrepancy Search (DDS) find solutions faster than a standard Depth-First Search (DFS) when provided with good valueselection heuristics. We propose a parallelization of DDS: Parallel Depthbounded Discrepancy Search (PDDS). This parallel search strategy has the property to visit the nodes of the search tree in the sam...
متن کاملInterleaved and Discrepancy Based Search
We present a detailed experimental comparison of interleaved depth-rst search and depth-bounded discrepancy search, two tree search procedures recently developed with the same goal: to reduce the cost of heuristic mistakes at the top of the tree. Our comparison uses an abstract heur-istic model, and three diierent concrete problem classes: binary constraint satisfaction, quasigroup completion a...
متن کامل